6.1 Metric Multiway Cut 16.1.1 Problem Setup and Lp 16.1.2 Rounding
نویسنده
چکیده
d is a metric d(ti, tj) ≥ 1 ∀ti, tj ∈ T where cuv is the cost of the edge between vertices u and v. 16.1.2 Rounding Once we’ve found an optimal solution to the metric LP above, we need to transform our metric to a cut metric, which will yield a valid multiway cut. As usual, we use the fact that LP ∗ ≤ OPT . To do this analysis, it will be useful to consider a set of interesting physical analogies for the quantities in our problem.
منابع مشابه
Simple and Fast Rounding Algorithms for Directed and Node-weighted Multiway Cut
We study the multiway cut problem in directed graphs and one of its special cases, the node-weighted multiway cut problem in undirected graphs. In DIRECTED MULTIWAY CUT (DIR-MC) the input is an edge-weighted directed graph G = (V,E) and a set of k terminal nodes {s1, s2, . . . , sk} ⊆ V ; the goal is to find a min-weight subset of edges whose removal ensures that there is no path from si to sj ...
متن کاملAnalysis of LP relaxations for multiway and multicut problems
We introduce in this paper an exact nonlinear formulation of the multiway cut problem. By simple linearizations of this formulation, we derive several well-known and new formulations for the problem. We further establish a connection between the multiway cut and the maximum-weighted independent set problem. This leads to the study of several instances of the multiway cut problem through the the...
متن کاملNonlinear Formations and Improved Randomized Approximation Algorithms for Multiway and Multicut Problems
We introduce nonlinear formulations of the multiway cut and multicut problems. By simple linearizations of these formulations we derive several well known formulations and valid inequalities as well as several new ones. Through these formulations we establish a connection between the multiway cut and the maximum weighted independent set problem that leads to the study of the tightness of severa...
متن کاملSubmodular Cost Allocation Problem and Applications
We study the Minimum Submodular-Cost Allocation problem (MSCA). In this problem we are given a finite ground set V and k non-negative submodular set functions f1, . . . , fk on V . The objective is to partition V into k (possibly empty) sets A1, · · · , Ak such that the sum ∑k i=1 fi(Ai) is minimized. Several well-studied problems such as the non-metric facility location problem, multiway-cut i...
متن کاملFrom Graph to Hypergraph Multiway Partition: Is the Single Threshold the Only Route?
We consider the Hypergraph Multiway Partition problem (Hyper-MP). The input consists of an edge-weighted hypergraph G = (V, E) and k vertices s1, . . . , sk called terminals. A multiway partition of the hypergraph is a partition (or labeling) of the vertices of G into k sets A1, . . . , Ak such that si ∈ Ai for each i ∈ [k]. The cost of a multiway partition (A1, . . . , Ak) is ∑k i=1 w(δ(Ai)), ...
متن کامل